Linear Convergence in the Approximation of Rank-one Convex Envelopes
نویسندگان
چکیده
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope f of a given function f : Rn×m → R, i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington. Mathematics Subject Classification. 65K10, 74G15, 74G65, 74N99. Received: May 27, 2003.
منابع مشابه
A numerical iterative scheme for computing finite order rank-one convex envelopes
Abstract. It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient numerical scheme for the computation of the finite order rank-one convex envelopes arises. In this paper, we develop an iterative scheme for such a purpose. The 1-st order rank-one convex envelope R1f is appro...
متن کاملModify the linear search formula in the BFGS method to achieve global convergence.
<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...
متن کاملNew three-step iteration process and fixed point approximation in Banach spaces
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
متن کاملApproximation of endpoints for multi-valued mappings in metric spaces
In this paper, under some appropriate conditions, we prove some $Delta$ and strong convergence theorems of endpoints for multi-valued nonexpansive mappings using modified Agarwal-O'Regan-Sahu iterative process in the general setting of 2-uniformly convex hyperbolic spaces. Our results extend and unify some recent results of the current literature.
متن کاملConvex Envelopes for Low Rank Approximation
In this paper we consider the classical problem of finding a low rank approximation of a given matrix. In a least squares sense a closed form solution is available via factorization. However, with additional constraints, or in the presence of missing data, the problem becomes much more difficult. In this paper we show how to efficiently compute the convex envelopes of a class of rank minimizati...
متن کامل